|
|
Selected Extensions of the Albegraic System Octave
Salač, Radek ; Smrčka, Aleš (referee) ; Vojnar, Tomáš (advisor)
This work deals with issues linked to solving system of linear equations in the environment of numerical computer. It describes the fundamental algorithms emphasizing their positive as well as negative sides. The work is devoted to general issues such as time complexity and memory demandingness of given algorithms. In the last part, the process of implementation of selected procedures into the algebraic system Octave is described.
|
|
|
Numerical methods for vortex dynamics
Outrata, Ondřej ; Hron, Jaroslav (advisor) ; Šístek, Jakub (referee)
Two aspects of solving the incompressible Navier-Stokes equations are described in the thesis. The preconditioning of the algebraic systems arising from the Finite Element Method discretization of the Navier-Stokes equations is complex due to the saddle point structure of the resulting algebraic problems. The Pressure Convection Diffusion Reaction and the Least Squares Commutator preconditioners constitute two possible choices studied in the thesis. Solving the flow problems in time-dependent domains requires special numerical methods, such as the Fictitious Boundary method and the Arbitrary Lagrangian Eulerian formulation of Navier-Stokes equations which are used in the thesis. The problems examined in the thesis are simulations of experiments conducted in liquid Helium at low temperatures. These simulations can be used to establish a relationship between vorticity and new quantity pseudovorticity in an experiment-like setting.
|
|
|
Krylov Subspace Methods - Analysis and Application
Gergelits, Tomáš ; Strakoš, Zdeněk (advisor) ; Farrell, Patrick (referee) ; Herzog, Roland (referee)
Title: Krylov Subspace Methods - Analysis and Application Author: Tomáš Gergelits Department: Department of Numerical Mathematics Supervisor: prof. Ing. Zdeněk Strakoš, DrSc., Department of Numerical Mathematics Abstract: Convergence behavior of Krylov subspace methods is often studied for linear algebraic systems with symmetric positive definite matrices in terms of the condition number of the system matrix. As recalled in the first part of this thesis, their actual convergence behavior (that can be in practice also substantially affected by rounding errors) is however determined by the whole spectrum of the system matrix, and by the projections of the initial residual to the associated invariant subspaces. The core part of this thesis investigates the spectra of infinite dimensional operators −∇ · (k(x)∇) and −∇ · (K(x)∇), where k(x) is a scalar coefficient function and K(x) is a symmetric tensor function, preconditioned by the Laplace operator. Subsequently, the focus is on the eigenvalues of the matrices that arise from the discretization using conforming finite elements. Assuming continuity of K(x), it is proved that the spectrum of the preconditi- oned infinite dimensional operator is equal to the convex hull of the ranges of the diagonal function entries of Λ(x) from the spectral decomposition K(x) =...
|
|
|
Towards efficient numerical computation of flows of non-Newtonian fluids
Blechta, Jan ; Málek, Josef (advisor) ; Herzog, Roland (referee) ; Süli, Endré (referee)
In the first part of this thesis we are concerned with the constitutive the- ory for incompressible fluids characterized by a continuous monotone rela- tion between the velocity gradient and the Cauchy stress. We, in particular, investigate a class of activated fluids that behave as the Euler fluid prior activation, and as the Navier-Stokes or power-law fluid once the activation takes place. We develop a large-data existence analysis for both steady and unsteady three-dimensional flows of such fluids subject either to the no-slip boundary condition or to a range of slip-type boundary conditions, including free-slip, Navier's slip, and stick-slip. In the second part we show that the W−1,q norm is localizable provided that the functional in question vanishes on locally supported functions which constitute a partition of unity. This represents a key tool for establishing local a posteriori efficiency for partial differential equations in divergence form with residuals in W−1,q . In the third part we provide a novel analysis for the pressure convection- diffusion (PCD) preconditioner. We first develop a theory for the precon- ditioner considered as an operator in infinite-dimensional spaces. We then provide a methodology for constructing discrete PCD operators for a broad class of pressure discretizations. The...
|
|
|
Krylov Subspace Methods - Analysis and Application
Gergelits, Tomáš ; Strakoš, Zdeněk (advisor) ; Farrell, Patrick (referee) ; Herzog, Roland (referee)
Title: Krylov Subspace Methods - Analysis and Application Author: Tomáš Gergelits Department: Department of Numerical Mathematics Supervisor: prof. Ing. Zdeněk Strakoš, DrSc., Department of Numerical Mathematics Abstract: Convergence behavior of Krylov subspace methods is often studied for linear algebraic systems with symmetric positive definite matrices in terms of the condition number of the system matrix. As recalled in the first part of this thesis, their actual convergence behavior (that can be in practice also substantially affected by rounding errors) is however determined by the whole spectrum of the system matrix, and by the projections of the initial residual to the associated invariant subspaces. The core part of this thesis investigates the spectra of infinite dimensional operators −∇ · (k(x)∇) and −∇ · (K(x)∇), where k(x) is a scalar coefficient function and K(x) is a symmetric tensor function, preconditioned by the Laplace operator. Subsequently, the focus is on the eigenvalues of the matrices that arise from the discretization using conforming finite elements. Assuming continuity of K(x), it is proved that the spectrum of the preconditi- oned infinite dimensional operator is equal to the convex hull of the ranges of the diagonal function entries of Λ(x) from the spectral decomposition K(x) =...
|
|
|
Numerical methods for vortex dynamics
Outrata, Ondřej ; Hron, Jaroslav (advisor) ; Šístek, Jakub (referee)
Two aspects of solving the incompressible Navier-Stokes equations are described in the thesis. The preconditioning of the algebraic systems arising from the Finite Element Method discretization of the Navier-Stokes equations is complex due to the saddle point structure of the resulting algebraic problems. The Pressure Convection Diffusion Reaction and the Least Squares Commutator preconditioners constitute two possible choices studied in the thesis. Solving the flow problems in time-dependent domains requires special numerical methods, such as the Fictitious Boundary method and the Arbitrary Lagrangian Eulerian formulation of Navier-Stokes equations which are used in the thesis. The problems examined in the thesis are simulations of experiments conducted in liquid Helium at low temperatures. These simulations can be used to establish a relationship between vorticity and new quantity pseudovorticity in an experiment-like setting.
|
|
|
Least-squares problems with sparse-dense matrices
Riegerová, Ilona ; Tůma, Miroslav (advisor) ; Tichý, Petr (referee)
Problém nejmenších čtverc· (dále jen LS problém) je aproximační úloha řešení soustav lineárních algebraických rovnic, které jsou z nějakého d·vodu za- tíženy chybami. Existence a jednoznačnost řešení a metody řešení jsou známé pro r·zné typy matic, kterými tyto soustavy reprezentujeme. Typicky jsou ma- tice řídké a obrovských dimenzí, ale velmi často dostáváme z praxe i úlohy s maticemi o proměnlivé hustotě nenulových prvk·. Těmi se myslí řídké matice s jedním nebo více hustými řádky. Zde rozebíráme metody řešení tohoto LS pro- blému. Obvykle jsou založeny na rozdělení úlohy na hustou a řídkou část, které řeší odděleně. Tak pro řídkou část m·že přestat platit předpoklad plné sloupcové hodnosti, který je potřebný pro většinu metod. Proto se zde speciálně zabýváme postupy, které tento problém řeší. 1
|
|
|
Towards efficient numerical computation of flows of non-Newtonian fluids
Blechta, Jan ; Málek, Josef (advisor) ; Herzog, Roland (referee) ; Süli, Endré (referee)
In the first part of this thesis we are concerned with the constitutive the- ory for incompressible fluids characterized by a continuous monotone rela- tion between the velocity gradient and the Cauchy stress. We, in particular, investigate a class of activated fluids that behave as the Euler fluid prior activation, and as the Navier-Stokes or power-law fluid once the activation takes place. We develop a large-data existence analysis for both steady and unsteady three-dimensional flows of such fluids subject either to the no-slip boundary condition or to a range of slip-type boundary conditions, including free-slip, Navier's slip, and stick-slip. In the second part we show that the W−1,q norm is localizable provided that the functional in question vanishes on locally supported functions which constitute a partition of unity. This represents a key tool for establishing local a posteriori efficiency for partial differential equations in divergence form with residuals in W−1,q . In the third part we provide a novel analysis for the pressure convection- diffusion (PCD) preconditioner. We first develop a theory for the precon- ditioner considered as an operator in infinite-dimensional spaces. We then provide a methodology for constructing discrete PCD operators for a broad class of pressure discretizations. The...
|
|
|
Diffuse interface models in theory of interacting continua
Řehoř, Martin ; Průša, Vít (advisor) ; Garcke, Harald (referee) ; Rohde, Christian (referee)
We study physical systems composed of at least two immiscible fluids occu- pying different regions of space, the so-called phases. Flows of such multi-phase fluids are frequently met in industrial applications which rises the need for their numerical simulations. In particular, the research conducted herein is motivated by the need to model the float glass forming process. The systems of interest are in the present contribution mathematically described in the framework of the so-called diffuse interface models. The thesis consists of two parts. In the modelling part, we first derive standard diffuse interface models and their generalized variants based on the concept of multi-component continuous medium and its careful thermodynamic analysis. We provide a critical assessment of assumptions that lead to different models for a given system. Our newly formulated class of generalized models of Cahn-Hilliard-Navier-Stokes-Fourier (CHNSF) type is applicable in a non-isothermal setting. Each model belonging to that class describes a mixture of separable, heat conducting Newtonian fluids that are either compressible or incompressible. The models capture capillary and thermal effects in thin interfacial regions where the fluids actually mix. In the computational part, we focus on the development of an efficient and robust...
|
|
|
Approximations by low-rank matrices and their applications
Outrata, Michal ; Tůma, Miroslav (advisor) ; Rozložník, Miroslav (referee)
Consider the problem of solving a large system of linear algebraic equations, using the Krylov subspace methods. In order to find the solution efficiently, the system often needs to be preconditioned, i.e., transformed prior to the iterative scheme. A feature of the system that often enables fast solution with efficient preconditioners is the structural sparsity of the corresponding matrix. A recent development brought another and a slightly different phe- nomenon called the data sparsity. In contrast to the classical (structural) sparsity, the data sparsity refers to an uneven distribution of extractable information inside the matrix. In practice, the data sparsity of a matrix ty- pically means that its blocks can be successfully approximated by matrices of low rank. Naturally, this may significantly change the character of the numerical computations involving the matrix. The thesis focuses on finding ways to construct Cholesky-based preconditioners for the conjugate gradi- ent method to solve systems with symmetric and positive definite matrices, exploiting a combination of the data and structural sparsity. Methods to exploit the data sparsity are evolving very fast, influencing not only iterative solvers but direct solvers as well. Hierarchical schemes based on the data sparsity concepts can be derived...
|
guest ::
